منابع مشابه
Pseudo-Valuation Near ring and Pseudo-Valuation N-group in Near Rings
In this paper, persents the definitions of strongly prime ideal, strongly prime N-subgroup, Pseudo-valuation near ring and Pseudo-valuation N-group. Some of their properties have also been proven by theorems. Then it is shown that, if N be near ring with quotient near-field K and P be a strongly prime ideal of near ring N, then is a strongly prime ideal of , for any multiplication subset S of...
متن کاملRepresenting Boolean Functions as Linear Pseudo-Boolean Constraints
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · l1 + . . .+am · lm ≥ d, where each li is a literal (it assumes the value 1 or 0 depending on whether a propositional variable xi is true or false) and the a1, . . . , am, d are natural numbers. The formalism can be viewed as a generalisation of a propositional clause. It has been said that LPBs can be used to represent B...
متن کاملPseudo-radial solutions of semi-linear elliptic equations on symmetric domains
In this paper we investigate existence and characterization of non-radial pseudo-radial (or separable) solutions of some semi-linear elliptic equations on symmetric 2-dimensional domains. The problem reduces to the phase plane analysis of a dynamical system. In particular, we give a full description of the set of pseudo-radial solutions of equations of the form ∆u = ±a2(|x|)u|u|q−1, with q > 0,...
متن کاملLearning Belief Networks in Pseudo-independent Domains
A pseudo-independent (PI) model is a probabilistic domain model (PDM) where proper subsets of a set of collectively dependent variables display marginal independence. It has been shown that several commonly used algorithms for learning belief networks will fail when the data generating model is a PI model. A better understanding of these models will facilitate the design of better learning algo...
متن کاملTowards Understanding of Pseudo-independent Domains
A pseudo-independent (PI) domain is a problem domain where a proper subset of a set of collectively dependent variables displays marginal independence. Common algorithms for learning belief networks cannot learn a faithful representation of the domain dependence when the data is obtained from a PI domain. Since we usually have no a priori knowledge whether a domain of interest is PI or not, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1971
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1971.101026